منابع مشابه
Sequential patterns analysis in a student database
This paper presents a data mining methodology to analyze the careers of students, where a career can be seen as a sequence of exams. The model is built using sequential pattern analysis and uses the algorithm SPAM. We consider an ideal career corresponding to a student which has taken each examination just after the end of the corresponding course, without delays. The frequent patterns identifi...
متن کاملDesign and Test of New Robust QCA Sequential Circuits
One of the several promising new technologies for computing at nano-scale is quantum-dot cellular automata (QCA). In this paper, new designs for different QCA sequential circuits are presented. Using an efficient QCA D flip-flop (DFF) architecture, a 5-bit counter, a novel single edge generator (SEG) and a divide-by-2 counter are implemented. Also, some types of oscillators, a new edge-t...
متن کاملSequential Circuit Test Generationin
|Test generation using deterministic fault-oriented algorithms is highly complex and time-consuming. New approaches are needed to augment the existing techniques, both to reduce execution time and to improve fault coverage. In this work, we describe a genetic algorithm (GA) framework for sequential circuit test generation. The GA evolves candidate test vectors and sequences, using a fault simul...
متن کاملSequential Locally Optimum Test (SLOT): A Sequential Detection Scheme Based on Locally Optimum Test Statistic
Based on the characteristics of the thresholds of two detection schemes employing locally optimum test statistics, a sequential detection design procedure is proposed and analyzed. The proposed sequential test, called the sequential locally optimum test (SLOT), inherently provides finite stopping time (terminates with probability one within the finite horizon), and thereby avoids undesirable fo...
متن کاملAsymptotic efficiency of a sequential multihypothesis test
that leading to (7) Theorem 1 implies REFERENCES 1 ; log $ 5 ; log-l-a! + ; " , " p log l/P n [ (+%y-(x " ,Y ") < l%M log cy-+-n n I which holds for all sufficiently large n because of (13). Then, (14) follows from (12) and the above inequality. 0 We conjecture that the bound (14) is in fact tight; however, the known approaches to the constructive part of the coding theorem are not sufficient t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1971
ISSN: 0003-4851
DOI: 10.1214/aoms/1177693328